package org.lxg.data.queue;

import org.lxg.data.array.SelfArray;

/**
 * 基于数组实现队列
 * @param <E>
 */
public class ArrayQueue<E> implements BaseQueue<E> {
    private SelfArray<E> array;

    public ArrayQueue(int capacity){
        array = new SelfArray<>(capacity);
    }

    public ArrayQueue(){
        array = new SelfArray<>();
    }

    @Override
    public int getSize(){
        return array.getSize();
    }

    @Override
    public boolean isEmpty(){
        return array.isEmpty();
    }

    public int getCapacity(){
        return array.getCapacity();
    }

    @Override
    public void enqueue(E e){
        array.addLast(e);
    }

    @Override
    public E dequeue(){
        return array.removeFirst();
    }

    @Override
    public E getFront(){
        return array.getFirst();
    }

    @Override
    public String toString(){
        StringBuilder res = new StringBuilder();
        res.append("Queue: ");
        res.append("front [");
        for(int i = 0 ; i < array.getSize() ; i ++){
            res.append(array.get(i));
            if(i != array.getSize() - 1)
                res.append(", ");
        }
        res.append("] tail");
        return res.toString();
    }
}
